Triadic Automata and Machines as Information Transformers
نویسندگان
چکیده
منابع مشابه
Monad Transformers as Monoid Transformers
The incremental approach to modular monadic semantics constructs complex monads by using monad transformers to add computational features to a preexisting monad. A complication of this approach is that the operations associated to the pre-existing monad need to be lifted to the new monad. In a companion paper by Jaskelioff, the lifting problem has been addressed in the setting of system Fω. Her...
متن کاملTuring Automata and Graph Machines
Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by generalizing the classical Turing machine concept, so that the collection of such machines becomes an indexed monoidal algebra. On the analogy of the von Neumann ...
متن کاملUltrametric automata and Turing machines
We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.
متن کاملA Triadic Model of Information Flow
This paper combines aspects of formal concept analysis, Barwise & Seligman’s information flow theory and a Peircean notion of triadic signs. The goal of the paper is to formalize a model of communication that includes explicit, formal representations of signs, conceptual entities that are denoted by the signs and contexts in which the signs are used. Each triad of signs, conceptual entities and...
متن کاملAutomata of Evolvable Computational Machines
Evolutionary algorithms (EA) were successfully applied to design of various computational machines in recent years. Some evolved designs have outperformed human designs especially in cases where no or weak design methodology is known for a given problem. Cellular automata [5] or digital circuits [6] are typical examples. In case of evolvable hardware, circuit implementation is usually evolved i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information
سال: 2020
ISSN: 2078-2489
DOI: 10.3390/info11020102